Word-functions of stochastic and pseudo stochastic automata

Stochastic Timed Automata Simulator

In the paper the idea of timed automata simulator is introduced. The proposed simulator is an extension of the UPPAAL tool simulator. Instead of choosing transition to be performed randomly or manually, the simulator calculates transition times according to transition guard and state invariant for each transition. A probability density function, which is needed for such calculation, is formally...

Learning Stochastic Finite Automata

Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of these finite state machines. In the setting of identification in the limit with probability one, we prove that stochastic deterministic finite automata cannot be identified from only a polynomial quantity of data. If concerned wit...

Stochastic Timed Automata

A stochastic timed automaton is a purely stochastic process defined on a timed automaton, in which both delays and discrete choices are made randomly. We study the almost-sure model-checking problem for this model, that is, given a stochastic timed automaton A and a property φ, we want to decide whether A satisfies φ with probability 1. In this paper, we identify several classes of automata and...

Stochastic Automata Networks

Generalized Automata and Stochastic Languages

1. Introduction. In a probabilistic automaton, as defined e.g. in [2] and [l], the initial vector as well as the transition matrices are stochastic, and the final vector consists of O's and l's only. This paper is concerned with the so-called generalized automata where the elements of the initial vector, of the final vector and of the matrices are allowed to be arbitrary real numbers. Our purpo...